ANT COLONY SEARCH METHOD IN PRACTICAL STRUCTURAL OPTIMIZATION

نویسندگان

  • O. Hasançebi
  • S. Çarbaş
چکیده مقاله:

This paper is concerned with application and evaluation of ant colony optimization (ACO) method to practical structural optimization problems. In particular, a size optimum design of pin-jointed truss structures is considered with ACO such that the members are chosen from ready sections for minimum weight design. The application of the algorithm is demonstrated using two design examples with practical design considerations. Both examples are formulated according to provisions of ASD-AISC (Allowable Stress Design Code of American Institute of Steel Institution) specification. The results obtained are used to discuss the computational characteristics of ACO for optimum design of truss type structures.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TOPOLOGY OPTIMIZATION OF SPACE STRUCTURES USING ANT COLONY METHOD

In this article, the ant colony method is utilized for topology optimization of space structures. Strain energy of the structure is minimized while the material volume is limited to a certain amount. In other words, the stiffest possible structure is sought when certain given materials are used. In addition, a noise cleaning technique is addressed to prevent undesirable members in optimum topol...

متن کامل

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

Ant Colony System Optimization

Successful heuristic algorithms for solving combinatorial optimization problems have mimicked processes observed in nature. Two highly successful families of algorithms that do this are simulated annealing and genetic algorithms. Here, a third family of algorithms, ant colony optimization is explored and implemented in C#. The test bed for evaluating the quality of solutions is based on several...

متن کامل

Ant Colony Optimization

Swarm intelligence is a relatively novel approach to problem solving that takes inspiration from the social behaviors of insects and of other animals. In particular, ants have inspired a number of methods and techniques among which the most studied and the most successful one is the ant colony optimization. Ant colony optimization (ACO) algorithm, a novel population-based and meta-heuristic app...

متن کامل

Evolving Ant Colony Optimization

Ant Colony Optimization (ACO) is a promising new approach to combinatorial optimization. Here ACO is applied to the traveling salesman problem (TSP). Using a genetic algorithm (GA) to nd the best set of parameters, we demonstrate the good performance of ACO in nding good solutions

متن کامل

Ant Colony Optimization Algorithm

Hybrid algorithm is proposed to solve combinatorial optimization problem by using Ant Colony and Genetic programming algorithms. Evolutionary process of Ant Colony Optimization algorithm adapts genetic operations to enhance ant movement towards solution state. The algorithm converges to the optimal final solution, by accumulating the most effective sub-solutions.

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 1  شماره 1

صفحات  91- 105

تاریخ انتشار 2011-03

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

کلمات کلیدی

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023